Modular implementation of presentations
نویسندگان
چکیده
منابع مشابه
Modular Implementat ion Presentations
The presentation of an application program specifies how the da ta and operations provided by an application are presented to users. Most t radit ional techniques for implementing presentations lead to unstructured, unmodular implementat ions that axe hard to construct and change. We present a model of presentat ion tha t identifies the dependencies between the presentat ion and functionality p...
متن کاملA Modular XQuery Implementation
CellStore/XQuery is modular a implementation of the XML Query Language interpreter. Primary goal of the implementation is to provide open experimental platform for implementing and testing new query optimization techniques for querying XML data. This paper describes architecture and design features of the implementation as well as possible approaches to extending the interpreter.
متن کاملEfficient Modular Division Implementation
Elliptic Curve Public Key Cryptosystems (ECPKC) are becoming increasingly popular for use in mobile appliances where bandwidth and chip area are strongly constrained. For the same level of security, ECPKC use much smaller key length than the commonly used RSA. The underlying operation of affine coordinates elliptic curve point multiplication requires modular multiplication, division/inversion a...
متن کاملFPGA Implementation of Modular Exponentiation
An e cient implementations of the main building block in the RSA cryptographic scheme is achieved by mapping a bit-level systolic array for modular exponentiation onto Xilinx FPGAs. One XC6000 chip, or 4 Kgates accommodates 132-bit long integers. 16 Kgates is required for modular exponentiation of 512 bit keys, with the estimated bit rate 800 Kb/sec. 1 Systolic Array for Modular Exponentiation ...
متن کاملFPGA Implementation of Modular Exponentiation Using Single Modular Multiplier
This paper presents the FPGA implementation of Modular Exponentiation (ME), based on Software/Hardware (SW/HW) approach. Indeed, in Rivest, Shamir and Adleman (RSA) cryptosystem, ME which is computed by series of Modular Multiplications (MM’s), is the main function to encrypt and decrypt data. In order to achieve the best trade-off between area, speed and flexibility, we propose in this work an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCHI Bulletin
سال: 1986
ISSN: 0736-6906
DOI: 10.1145/30851.275636